An elementary proof of the reconstruction conjecture

The reconstruction conjecture states that the multiset of vertex-deleted subgraphs of a graph determines the graph, provided it has at least 3 vertices. This problem was independently introduced by Stanis law Ulam (1960) and Paul Kelly (1957). In this paper, we prove the conjecture by elementary methods. It is only necessary to integrate the Lenkle potential of the Broglington manifold over the quantum supervacillatory measure in order to reduce the set of possible counterexamples to a small number (less than a trillion). A simple computer program that implements Pipletti’s classification theorem for torsion-free Aramaic groups with simplectic socles can then finish the remaining cases. Mathematics Subject Classifications: 05C88, 05C89